Approximate congruence in nearly linear time
نویسندگان
چکیده
منابع مشابه
Nearly Linear Time
The notion of linear-time computability is very sensitive to machine model. In this connection, we introduce a class NLT of functions computable in nearly linear time n(log n)O(1) on random access computers. NLT is very robust and does not depend on the particular choice of random access computers. Kolmogorov machines, Schonhage machines, random access Turing machines, etc. also compute exactl...
متن کاملData dependent kernels in nearly-linear time
We propose a method to efficiently construct data-dependent kernels which can make use of large quantities of (unlabeled) data. Our construction makes an approximation in the standard construction of semi-supervised kernels in Sindhwani et al. (2005). In typical cases these kernels can be computed in nearly-linear time (in the amount of data), improving on the cubic time of the standard constru...
متن کاملNearly Linear-Time Model-Based Compressive Sensing
Compressive sensing is a method for recording a k-sparse signal x ∈ R with (possibly noisy) linear measurements of the form y = Ax, where A ∈ Rm×n describes the measurement process. Seminal results in compressive sensing show that it is possible to recover the signal x from m = O(k log n k ) measurements and that this is tight. The model-based compressive sensing framework overcomes this lower ...
متن کاملApproximate earth mover's distance in linear time
Theorem 2 ([3]). f ∈ Lloc(R n), belongs to Cs(Rn) if and only if, in a wavelet decomposition of regularity r ≥ 1 > s there exist constants C0 and C1 such that, Approx. coeffs.: |fk| ≤ C0, k ∈ Z n and Detail coeffs.: |fλ| ≤ C12 −j(n/2+s), λ ∈ Λj, j ≥ 0 (1) Lemma 1. If 0 < s < 1 and (1) holds, then f ∈ Cs(Rn) with CH(f ) < C such that a12(ψ; s)C1 ≤ C ≤ a21(ψ; s)C0 + a22(ψ; s)C1 (2) For discrete d...
متن کاملOn Linear Time and Congruence in Channel-passing Calculi
Process algebras such as CSP or the Pi-calculus are theories to reason about concurrent software. The Pi-calculus also introduces channel passing to address specific issues in mobility. Despite their similarity, the languages expose salient divergences at the formal level. CSP is built upon trace semantics while labeled transition systems and bisimulation are the privileged tools to discuss the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2003
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(02)00095-0